The linear discrete Polya algorithm
نویسندگان
چکیده
منابع مشابه
Rate of Convergence of the Discrete Polya Algorithm from Convex Sets. a Particular Case
In this work we deal with best approximation in `p , 1 < p ≤ ∞, n ≥ 2. For 1 < p < ∞, let hp denote the best `p -approximation to f ∈ R from a closed, convex subset K of R, f 6∈ K, and let h∗ be a best uniform approximation to f from K. In case that h∗ − f = (ρ1, ρ2, · · · , ρn), |ρj | = ρ for j = 1, 2, · · · , n, we show that the behavior of ‖hp − h∗‖ as p→∞ depends on a property of separation...
متن کاملPerformance of the Viterbi Algorithm on a Polya Channel
The Performance of the Viterbi algorithm with a new Polya contagion noise process is analyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya channel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a GaussPolya noise model is introduced this way in order to perf...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1995
ISSN: 0893-9659
DOI: 10.1016/0893-9659(95)00080-a